Decidability for some justification logics with negative introspection
نویسنده
چکیده
Justification logics are modal logics that include justifications for the agent’s knowledge. So far, there are no decidability results available for justification logics with negative introspection. In this paper, we develop a novel model construction for such logics and show that justification logics with negative introspection are decidable for finite constant specifications. §
منابع مشابه
Justifications, Ontology, and Conservativity
An ontologically transparent semantics for justifications that interprets justifications as sets of formulas they justify has been recently presented by Artemov. However, this semantics of modular models has only been studied for the case of the basic justification logic J, corresponding to the modal logic K. It has been left open how to extend and relate modular models to the already existing ...
متن کاملDecidability for Justification Logics Revisited
Justification logics are propositional modal-like logics that instead of statements A is known include statements of the form A is known for reason t where the term t can represent an informal justification for A or a formal proof of A. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in...
متن کاملA Syntactic Realization Theorem for Justification Logics
Justification logics are refinements of modal logics where modalities are replaced by justification terms. They are connected to modal logics via so-called realization theorems. We present a syntactic proof of a single realization theorem that uniformly connects all the normal modal logics formed from the axioms d, t, b, 4, and 5 with their justification counterparts. The proof employs cut-free...
متن کاملEpistemic logics for sceptical agents
In this article, we introduce an epistemic modal operator modelling knowledge over distributive non-associative full Lambek calculus with a negation. Our approach is based on the relational semantics for substructural logics: we interpret the elements of a relational frame as information states consisting of collections of data. The principal epistemic relation between the states is the one of ...
متن کاملAutoepistemic Logics of Closed Beliefs and Logic Programming
Moore's autoepistemic logic AEL proved to be a very successful approach to formalizing non-monotonic reasoning and logic programming. However, AEL also has some important drawbacks, e.g., quite \reasonable" theories are often inconsistent in AEL, it does not always lead to the expected, intended semantics and it cannot be eeectively computed even for very simple classes of theories. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 78 شماره
صفحات -
تاریخ انتشار 2013